Forbidden minors for the class of graphs G with ξ ( G ) ⩽ 2
نویسندگان
چکیده
For a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and ij is an edge in G. In [2], ξ(G) is defined to be the maximum corank (i.e., nullity) among A ∈ S(G) having the Strong Arnold Property; ξ is used to study the minimum rank/maximum eigenvalue multiplicity problem for G. Since ξ is minor monotone, the graphs G such that ξ(G) ≤ k can be described by a finite set of forbidden minors. We determine the forbidden minors for ξ(G) ≤ 2 and present an application of this characterization to computation of minimum rank among matrices in S(G).
منابع مشابه
Forbidden Minors for the Class of Graphs
For a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and ij is an edge in G. In [2], ξ(G) is defined to be the maximum corank (i.e., nullity) among A ∈ S(G) having the Strong Arnold Property; ξ is used to study the minimum rank/maximum eigenvalue multiplicity problem for G. Since ξ is minor monotone, the graphs G ...
متن کاملFree Minor Closed Classes and the Kuratowski theorem
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered. We are using usual definitions of the graph theory [1]. Considering graph topologically and Kuratowski theorem, we use the notion of minor following the theory of Robertson and Seymour[2]. We say, that a grap...
متن کاملOn cographic matroids and signed-graphic matroids
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff G imbeds in the projective plane. In the case that G is nonplanar, we also show that Σ must be the projective-planar dual signed graph of an actual imbedding of G in the projective plane. As a corollary we get that, if G1, . . . , G29 denote the 29 nonseparable forbidden minors for projective-pl...
متن کاملA new graph parameter related to bounded rank positive semidefinite matrix completions
The Gram dimension gd(G) of a graph G is the smallest integer k ≥ 1 such that any partial real symmetric matrix, whose entries are specified on the diagonal and at the off-diagonal positions corresponding to edges of G, can be completed to a positive semidefinite matrix of rank at most k (assuming a positive semidefinite completion exists). For any fixed k the class of graphs satisfying gd(G) ≤...
متن کاملGrowth constants of minor-closed classes of graphs
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor-closed class G, let gn be the number of graphs in G which have n vertices. The growth constant of G is γ = lim sup(gn/n!) . We study the properties of the set Γ of growth constants of minor-closed classes of graphs. Among other results, we show that Γ does not contai...
متن کامل